Voting rule FI Gaps FP TOS PC CEV 1 TOS 1 Gap TTO BTO Plurality P NPC NPC NPC NPC P P NPC P NPC 2 - Approval P NPC NPC NPC NPC P P NPC P NPC

In bribery an external agent tries to alter the outcome of an election by changing some voters’ votes. Usually, when investigating bribery problems, full information is assumed, i.e., that the manipulative agent knows the set of candidates, each voter’s votes and the voting rule used. In this paper, we formally introduce different structures of partial information, we show the connections between them and existing notions, define bribery under partial profiles, and examine the complexity of bribery under partial information for the k-Approval and k-Veto rules.